全文获取类型
收费全文 | 9532篇 |
免费 | 769篇 |
国内免费 | 261篇 |
专业分类
化学 | 1197篇 |
晶体学 | 27篇 |
力学 | 1062篇 |
综合类 | 149篇 |
数学 | 6768篇 |
物理学 | 1359篇 |
出版年
2024年 | 12篇 |
2023年 | 100篇 |
2022年 | 199篇 |
2021年 | 308篇 |
2020年 | 196篇 |
2019年 | 215篇 |
2018年 | 236篇 |
2017年 | 327篇 |
2016年 | 312篇 |
2015年 | 222篇 |
2014年 | 459篇 |
2013年 | 551篇 |
2012年 | 611篇 |
2011年 | 474篇 |
2010年 | 448篇 |
2009年 | 553篇 |
2008年 | 549篇 |
2007年 | 603篇 |
2006年 | 487篇 |
2005年 | 424篇 |
2004年 | 335篇 |
2003年 | 317篇 |
2002年 | 282篇 |
2001年 | 264篇 |
2000年 | 251篇 |
1999年 | 178篇 |
1998年 | 192篇 |
1997年 | 181篇 |
1996年 | 130篇 |
1995年 | 160篇 |
1994年 | 132篇 |
1993年 | 113篇 |
1992年 | 100篇 |
1991年 | 86篇 |
1990年 | 75篇 |
1989年 | 61篇 |
1988年 | 47篇 |
1987年 | 40篇 |
1986年 | 38篇 |
1985年 | 53篇 |
1984年 | 50篇 |
1983年 | 14篇 |
1982年 | 22篇 |
1981年 | 21篇 |
1980年 | 17篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
991.
D. Ghose 《Journal of Optimization Theory and Applications》1991,68(3):463-481
In this paper, a scalar game is derived from a zero-sum multicriteria matrix game, and it is proved that the solution of the new game with strictly positive scalarization is a necessary and sufficient condition for a strategy to be a Pareto-optimal security strategy (POSS) for one of the players in the original game. This is done by proving that a certain set, which is the extension of the set of security level vectors in the criterion function space, is convex and polyhedral. It is also established that only a finite number of scalarizations are necessary to obtain all the POSS for a player. An example is included to illustrate the main steps in the proof.This work was done while the author was a Research Associate in the Department of Electrical Engineering at the Indian Institute of Science and was financially supported by the Council of Scientific and Industrial Research, Delhi, India.The author wishes to express his gratefulness to Professor U. R. Prasad for helpful discussions and to two anonymous referees for suggestions which led to an improved presentation. 相似文献
992.
Analterable digraph is a digraph with a subset of its edges marked alterable and their orientations left undecided. We say that an alterable digraph has an invariant ofk on the length of the longest circuit if it has a circuit of length at leastk regardless of the orientations over its alterable edges. Computing the maximum invariant on the length of the longest circuit in an alterable digraph is aglobal optimization problem. We show that it is hard to approximate the global optimal solution for the maximum invariant problem.Research supported in part by NSF grant CCR 9121472. 相似文献
993.
Two algorithms for finding a global minimum of the product of two affine fractional functions over a compact convex set and solving linear fractional programs with an additional constraint defined by the product of two affine fractional functions are proposed. The algorithms are based on branch and bound techniques using an adaptive branching operation which takes place in one-dimensional intervals. Results from numerical experiments show that large scale problems can be efficiently solved by the proposed methods. 相似文献
994.
There are two main classes of iterative methods in nondifferentiable optimization (NDO). In thebasic NDO, the information is limited to the objective function and at least one element of its subdifferential, while in thecomposite NDO, the objective function is split into a sum of a smooth and a nonsmooth function. Our work unifies these two approaches for benefiting of their respective advantages. 相似文献
995.
Qamrul Hasan Ansari Siegfried Schaible Jen-Chih Yao 《Journal of Global Optimization》2002,22(1-4):3-16
In this paper, we introduce the system of generalized vector equilibrium problems which includes as special cases the system of generalized implicit vector variational inequality problems, the system of generalized vector variational and variational-like inequality problems and the system of vector equilibrium problems. By using a maximal element theorem, we establish existence results for a solution of these systems. As an application, we derive existence results for a solution of a more general Nash equilibrium problem for vector-valued functions. 相似文献
996.
The system design must be started from the concept with low cost and high performance. In this point, the topological shape of the structure is very important in the view of the structural rigidities and light-weight design.In this paper, the optimization methodology is presented in the design stage of the large optical mirror. We obtain the optimal layout through the topology optimization and then design the details through the size or shape optimization for structural rigidity. 相似文献
997.
This work shows how disjunctive cuts can be generated for a bilevel linear programming problem (BLP) with continuous variables.
First, a brief summary on disjunctive programming and bilevel programming is presented. Then duality theory is used to reformulate
BLP as a disjunctive program and, from there, disjunctive programming results are applied to derive valid cuts. These cuts
tighten the domain of the linear relaxation of BLP. An example is given to illustrate this idea, and a discussion follows
on how these cuts may be incorporated in an algorithm for solving BLP. 相似文献
998.
Peter Francis Guangming Zhang Karen Smilowitz 《European Journal of Operational Research》2007,180(3):1045-1059
This paper presents modeling and solution method improvements for the Multi-Resource Routing Problem (MRRP) with flexible tasks. The MRRP with flexible tasks is used to model routing and scheduling problems for intermodal drayage operations in which two resources (tractors and trailers) perform tasks to transport loaded and empty equipment. Tasks may be either well defined, in which both the origin and the destination of a movement are given, or flexible, in which the origin or the destination is chosen by the model. This paper proposes methods to effectively manage the number of options considered for flexible tasks (either feasible origins for a known destination or feasible destinations for a known origin). This modeling change generates sufficient options to allow for low-cost solutions while maintaining reasonable computational effort. We also propose a new solution method that uses randomized route generation. Computational results from test cases show that these changes improve the quality of solutions by at least 5% in the test cases as compared to methods from previous studies. 相似文献
999.
Rafael Caballero Mercedes González Flor M Guerrero Julián Molina Concepción Paralera 《European Journal of Operational Research》2007
In this work we present a multiobjective location routing problem and solve it with a multiobjective metaheuristic procedure. In this type of problem, we have to locate some plants within a set of possible locations to meet the demands of a number of clients with multiple objectives. This type of model is used to solve a problem with real data in the region of Andalusia (Spain). Thus, we study the location of two incineration plants for the disposal of solid animal waste from some preestablished locations in Andalusia, and design the routes to serve the different slaughterhouses in this region. This must be done while taking into account certain economic objectives (start-up, maintenance, and transport costs) and social objectives (social rejection by towns on the truck routes, maximum risk as an equity criterion, and the negative implications for towns close to the plant). 相似文献
1000.
José Fernández Blas Pelegrı´n Frank Plastria Boglárka Tóth 《European Journal of Operational Research》2007
A chain wants to set up a single new facility in a planar market where similar facilities of competitors, and possibly of its own chain, are already present. Fixed demand points split their demand probabilistically over all facilities in the market proportionally with their attraction to each facility, determined by the different perceived qualities of the facilities and the distances to them, through a gravitational or logit type model. Both the location and the quality (design) of the new facility are to be found so as to maximise the profit obtained for the chain. Several types of constraints and costs are considered. 相似文献